منابع مشابه
Optimal P{cyclic Sor
Our purpose in this paper is to extend p{cyclic SOR theory to consistent singular systems and to apply the results to the solution of large scale systems arising, e.g., in queueing network problems in Markov analysis. Markov chains and queueing models lead to structured singular linear systems and are playing an increasing role in the understanding of complex phenomena arising in computer, comm...
متن کاملOn Sor Waveform Relaxation Methods
Waveform relaxation is a numerical method for solving large-scale systems of ordinary differential equations on parallel computers. It differs from standard iterative methods in that it computes the solution on many time levels or along a continuous time interval simultaneously. This paper deals with the acceleration of the standard waveform relaxation method by successive overrelaxation (SOR) ...
متن کاملThe Sigma-sor Algorithm and the Optimal Strategy for the Utilization of the Sor Iterative Method
The paper describes, discusses, and numerically illustrates the method for obtaining a priori estimates of the optimum relaxation factor in the SOR iteration method. The computational strategy of this method uses the so-called Sigma-SOR algorithm based on the theoretical result proven in the paper. The method presented is especially efficient for problems with slowly convergent iteration proces...
متن کاملBlock SOR for Kronecker structured representations
The Kronecker structure of a hierarchical Markovian model (HMM) induces nested block partitionings in the transition matrix of its underlying Markov chain. This paper shows how sparse real Schur factors of certain diagonal blocks of a given partitioning induced by the Kronecker structure can be constructed from smaller component matrices and their real Schur factors. Furthermore, it shows how t...
متن کاملRandom reordering in SOR-type methods
When iteratively solving linear systems By = b with Hermitian positive semi-definite B, and in particular when solving least-squares problems for Ax = b by reformulating them as AA∗y = b, it is often observed that SOR type methods (Gauß-Seidel, Kaczmarz) perform suboptimally for the given equation ordering, and that random reordering improves the situation on average. This paper is an attempt t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Industry Applications
سال: 1988
ISSN: 0913-6339,1348-8163
DOI: 10.1541/ieejias.108.808